CHiPPS: A Framework for Implementing Parallel Search Algorithms

نویسندگان

  • Y. Xu
  • T. K. Ralphs
چکیده

The COIN-OR High Performance Parallel Search (CHiPPS) framework is a C++ class library for implementing and parallelizing tree search algorithms. It currently consists of a library of base classes known as the Abstract Library for Parallel Search (ALPS) and two other layers useful for implementing algorithms based on mathematical programming paradigms. Because of its general approach, however, ALPS supports the implementation of a wide variety of tree search algorithms and applications by creating derived classes implementing specific algorithmic components. CHiPPS employs a number of features to improve scalability and is designed specifically to support the implementation of data intensive algorithms, in which large amounts of knowledge are generated and must be maintained and shared during the search. Implementing such algorithms in a scalable manner is challenging both because of storage requirements and because of communications overhead incurred in the sharing of data. In this abstract, we describe the design of CHiPPS, focusing primarily on the ALPS layer, and indicate how the design addresses these challenges.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALPS: A Framework for Implementing Parallel Search Algorithms

ALPS is a framework for implementing and parallelizing tree search algorithms. It employs a number of features to improve scalability and is designed specifically to support the implementation of data intensive algorithms, in which large amounts of knowledge are generated and must be maintained and shared during the search. Implementing such algorithms in a scalable manner is challenging both b...

متن کامل

A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems

In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...

متن کامل

New Formulation and Solution in PCB Assembly Systems with Parallel Batch processors

This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...

متن کامل

Computational Experience with Generic Decomposition using the DIP Framework

Decomposition methods are techniques for exploiting the tractable substructures of an integer program in order to obtain improved solution techniques. In particular, the fundamental idea is to exploit our ability to either optimize over and/or separate from the convex hull of solutions to a given relaxation in order to derive improved methods of bounding the optimal solution value. These boundi...

متن کامل

Hybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage

In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010